Blanchard and Davies: Recovery Guarantees for Rank Aware Pursuits
نویسندگان
چکیده
This paper considers sufficient conditions for sparse recovery in the sparse multiple measurement vector (MMV) problem for some recently proposed rank aware greedy algorithms. Specifically we consider the compressed sensing framework with random measurement matrices and show that the rank of the measurement matrix in the sparse MMV problem allows such algorithms to reduce the effect of the log n term that is present in traditional OMP recovery.
منابع مشابه
Optimal Recovery of Tensor Slices
We consider the problem of large scale matrix recovery given side information in the form of additional matrices of conforming dimension. This is a parsimonious model that captures a number of interesting problems including context and location aware recommendations, personalized ‘tag’ learning, demand learning with side information, etc. Viewing the matrix we seek to recover and the side infor...
متن کاملPerformance Guarantees for Schatten-$p$ Quasi-Norm Minimization in Recovery of Low-Rank Matrices
We address some theoretical guarantees for Schatten-p quasi-norm minimization (p ∈ (0, 1]) in recovering low-rank matrices from compressed linear measurements. Firstly, using null space properties of the measuring operator, we provide a sufficient condition for exact recovery of low-rank matrices. This condition guarantees unique recovery of matrices of ranks equal or larger than what is guaran...
متن کاملGuarantees of Augmented Trace Norm Models in Tensor Recovery
This paper studies the recovery guarantees of the models of minimizing ‖X‖∗ + 1 2α‖X‖F where X is a tensor and ‖X‖∗ and ‖X‖F are the trace and Frobenius norm of respectively. We show that they can efficiently recover low-rank tensors. In particular, they enjoy exact guarantees similar to those known for minimizing ‖X‖∗ under the conditions on the sensing operator such as its null-space property...
متن کاملSoft Recovery Through ℓ1, 2 Minimization with Applications in Recovery of Simultaneously Sparse and Low-Rank Matrice
This article provides a new type of analysis of a compressed-sensing based technique for recovering columnsparse matrices, namely minimization of the l1,2-norm. Rather than providing conditions on the measurement matrix which guarantees the solution of the program to be exactly equal to the ground truth signal (which already has been thoroughly investigated), it presents a condition which guara...
متن کاملGreedy signal recovery and uncertainty principles
This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements – L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of the Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of t...
متن کامل